排序方式: 共有91条查询结果,搜索用时 15 毫秒
71.
针对基于电力线载波通信(PLC,Power Line Communication)技术的LED路灯监控系统,基于蚁群算法(ACA,Ant Colony Algorithm)开发了一种适用于低压配电网的LED路灯组网寻址算法,并在目标函数、信息素更新规则、状态转移规则和搜索等方面做了优化改进。建立了路灯自动路由模型,并给出自动路由协议框架。通过该模型,可动态识别低压配电网信道质量,并根据信道质量变化,动态维护电力线载波通信网络路由,保证通信网络有效性。最后,通过信道仿真模型和现场试验验证了该方法的可行性和有效性。 相似文献
72.
本文基于双路由单元研究了SpaceWire总线的性能评价体系。研究中,首先给出了双路由单元的定义,推导了基于双路由单元的路由系统的数据传输时间和资源耗费的计算方法;其次推导了基于双路由单元的多路由拓扑系统的性能评价体系;然后采用蒙特卡洛模拟的方法建立了双路由单元系统的模拟平台,仿真计算了路由单元在不同接口配置情况下的性能。研究结果表明:基于双路由单元的传输时间和资源耗费指标能够评价SpaceWire总线的性能;并且在不同接口配置时,存在一种最佳的配置方式能够使得系统的性能达到最优。 相似文献
73.
多个方向的可扩展特性是新一代互联网的重要特点,这对高性能路由器的性能、规模、功能和服务等能力提出了更高的要求,高速路由与交换技术是承载这种可扩展特性的关键技术。从网络处理器设计、路由查找技术以及高速交换技术三个方面总结了高速路由与交换技术的研究和发展现状,并展望了未来的发展趋势。 相似文献
74.
During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
75.
战术MANET的QoS路由计算是一个NP完全问题,可以采用蚁群优化算法来求解.为了提高蚁群优化QoS路由算法的效率,降低时延和网络开销,提出了基于多态转移策略的蚁群优化QoS路由算法(MTS-AQRA).MTS-AQRA将链路稳定性和路由拥塞度与常规的QoS路由约束条件结合起来,利用多态转移策略产生的多样化路由搜索蚁群和并行路由搜索处理,能够在MANET网络中快速地建立满足业务QoS要求的稳定路由.仿真实验结果表明,MTS-AQRA在分组到达率、端到端时延、网络吞吐量等指标上综合性能优于AODV、AntHocNet、QoS-Aware ACO等路由算法. 相似文献
76.
Irina S. Dolinskaya 《海军后勤学研究》2012,59(5):325-339
This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
77.
78.
航空集群机载网络作为集群成员间信息交互的纽带,其路由策略性能优劣直接影响信息传输实时性与可靠性,从而制约网络化集群作战效能发挥.考虑到航空集群机载网络具有诸多不确定性,为应对路由失效以及尽可能避免路由更新,从路由选择算法的角度,在软件定义网络架构下提出Failure-Oblivious路由策略.与传统路由策略不同的是,... 相似文献
79.
In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
80.